Note on the estimation of informative predictor subspace and projective-resampling informative predictor subspace
نویسندگان
چکیده
منابع مشابه
Classification in an informative sample subspace
We have developed an Informative Sample Subspace (ISS) method that is suitable for projecting high dimensional data onto a low dimensional subspace for classification purposes. In this paper, we present an ISS algorithm that uses a maximal mutual information criterion to search a labelled training dataset directly for the subspace’s projection base vectors. We evaluate the usefulness of the ISS...
متن کاملCriteria for informative experiments with subspace identification
Informative experiments are identification experiments which contain sufficient information for an identification algorithm to discriminate between different models in an intended model set. In this paper, a particular set of identification algorithms, namely subspace based identification, is considered. Criteria for experiments to be informative with these methods in the deterministic setup an...
متن کاملInformative Subspace Learning for Counterfactual Inference
Inferring causal relations from observational data is widely used for knowledge discovery in healthcare and economics. To investigate whether a treatment can affect an outcome of interest, we focus on answering counterfactual questions of this type: what would a patient’s blood pressure be had he/she recieved a different treatment? Nearest neighbor matching (NNM) sets the counterfactual outcome...
متن کاملSparse Estimation for Predictor-Based Subspace Identification of LPV Systems
This paper presents a Basis Pursuit DeNoising (BPDN) sparse estimation approach as a regularization technique in a predictor-based subspace method for the identification of Linear ParameterVarying (LPV) state-space systems. It is known that in this identification method, the choice of the past window of a state predictor factorization will influence the conditioning of the main parameter estima...
متن کاملInfinite Predictor Subspace Models for Multitask Learning
Given several related learning tasks, we propose a nonparametric Bayesian model that captures task relatedness by assuming that the task parameters (i.e., predictors) share a latent subspace. More specifically, the intrinsic dimensionality of the task subspace is not assumed to be known a priori. We use an infinite latent feature model to automatically infer this number (depending on and limite...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ??????
سال: 2022
ISSN: ['2071-9477', '2521-408X']
DOI: https://doi.org/10.5351/kjas.2022.35.5.657